Search results for "Scapegoat tree"

showing 2 items of 2 documents

On the listing and random generation of hybrid binary trees

1994

We consider in this paper binary trees whose internal nodes are either associative or non-associative. Hybrid binary trees are equivalence classes with respect to the associative property. We count, list and generate randomly hybrid binary trees using Fibonacci numbers.

Discrete mathematicsBinary treeApplied MathematicsWeight-balanced treeScapegoat treeRandom binary treeComputer Science ApplicationsCombinatoricsComputational Theory and MathematicsBinary search treeGeometry of binary search treesTernary search treeBinary expression treeMathematicsInternational Journal of Computer Mathematics
researchProduct

Generation of Valid Labeled Binary Trees

2003

International audience; Generating binary trees is a well-known problem. In this paper, we add some constraints to leaves of these trees. Such trees are used in the morphing of polygons, where a polygon P is represented by a binary tree T and each angle of P is a weight on a leaf of T. In the following, we give two algorithms to generate all binary trees, without repetitions, having the same weight distribution to their leaves and representing all parallel polygons to P.

Discrete mathematicsBinary treeOptimal binary search tree[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Weight-balanced tree[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]Scapegoat treeComputer Science::Computational GeometryRandom binary treeCombinatoricsBinary search treeTernary search treeMetric treeMathematicsComputingMethodologies_COMPUTERGRAPHICS
researchProduct